#include<cstdio>//uncle-lu
#include<algorithm>
template<class T>void read(T &x)
{
	x=0;int f=0;char ch=getchar();
	while(ch<'0'||ch>'9') { f|=(ch=='-'); ch=getchar(); }
	while(ch<='9'&&ch>='0') { x=(x<<1)+(x<<3)+(ch^48); ch=getchar(); }
	x = f ? -x : x;
	return ;
}

void add_edge(int, int, int);

int n;
struct node{
	int v, next, val;
};

void add_edge(int x, int y, int val)
{

}

int main()
{
	int ml, dl;
	read(n); read(ml); read(dl); 

	int a, b, c;
	for(int i=1; i<=ml; ++i)
	{
		read(a);read(b);read(c);
		add_edge(a, b, c);
	}

	return 0;
}
